Systems and methods for rig scheduling with optimal fleet sizing

ABSTRACT

Systems and methods for optimizing oilfield rig fleet scheduling and deployment are disclosed. Wells are identified to have time constraints by which they are grouped into “ON”, “BY”, and “ADD” categories. ON wells have a beginning drilling availability window; BY wells have an ending drilling availability time only; and ADD wells have no beginning or ending time of drilling availability. The systems and methods optimize scheduling with ON wells having higher priority than BY wells, and BY wells having higher priority than ADD wells.

BACKGROUND

For oilfield drilling operations, the rig scheduling problem concerns finding a schedule for a fleet of rigs given a list of potential wells to be drilled. Each rig has a capacity and time period of availability, while each well comprises a production value, a pad assignment and a time window in which it can be drilled. Operational constraints limit the number of rigs on a pad to one, and the moving and dismantling time is applicable each time a rig moves from one pad to another. There is a need for an improved method for optimizing resources.

BRIEF DESCRIPTION OF THE FIGURES

FIG. 1 illustrates pseudo code for weight scoring method according to embodiments of the present disclosure.

FIG. 2 illustrates pseudo code for the Greedy method according to embodiments of the present disclosure.

FIG. 3 illustrates pseudo code for a scheduling algorithm according to embodiments of the present disclosure.

FIG. 4 is a schematic diagram illustrating systems and methods for optimizing rig scheduling according to embodiments of the present disclosure.

FIG. 5 is a schematic diagram depicting an optimizing algorithm according to embodiments of the present disclosure.

FIG. 6 is a schematic block diagram showing a method according to embodiments of the present disclosure.

FIG. 7 is a schematic block diagram of a method according to further embodiments of the present disclosure.

FIG. 8 illustrates pseudo code for a fast greedy method according to embodiments of the present disclosure.

SUMMARY

Embodiments of the present disclosure are directed to a method including receiving a list of wells to be drilled and dividing the wells into ON wells which have a specific start date of availability, BY wells which have a fixed end date of availability but no start date of availability; and ADD wells which have no start or end data of availability. Availability in this context generally means that the well is available to be accessed and/or drilled. The method also includes receiving fleet data, wells data, and parameters, wherein the parameters include a time horizon for the drilling operation. The method also includes attempting to solve an integer problem according to the ON wells, and if the integer problem is solved, implementing a greedy method for BY wells and a weight scoring method for ADD wells. If the integer problem is not solved, the method continues by implementing the weight scoring method for all wells, and outputting a schedule for rigs and the wells.

The greedy method may include sorting wells according to the earliest day on which the wells are available and then by a value of the wells, and for each rig available to drill, identifying an earliest start date and assigning a rig to the start date for the well. The weight scoring method may include identifying urgent wells. An urgent well is a well in which the earliest time to start drilling the well is earlier than the earliest time a rig is available, when factoring in the cost of using the rig and a moving cost for the rig. The method also includes identifying non-urgent wells. A non-urgent well has a potential start date such that there is an available start date for at least one rig that is earlier than the earliest available date for the well. The method also includes randomly choosing weights, repeatedly calculating a solution using weights generated by the weights, and retaining a solution that maximizes an objective value of the solution. If there is no improvement of the objective value of the solution after a predetermined number of attempts, the method continues by ceasing calculating the solution and delivering the retained solution. Urgent wells are given higher priority than non-urgent wells.

Other embodiments are directed to a method for optimizing fleet scheduling, including identifying ON wells which have a beginning time of availability, BY wells which have an end time but no beginning time of availability, and ADD wells which have no beginning or end time of availability, according to ON, BY, and ADD constraints. The method also includes scheduling rigs to drill the wells with ON wells having higher priority than BY wells, and with BY wells having higher priority than ADD wells, and returning a schedule for rigs and wells, the schedule having a value corresponding to a number of ON, BY, and ADD constraints which are satisfied by the schedule.

Still further embodiments of the present disclosure are directed to a system for optimizing a rig schedule for drilling a plurality of wells. The system includes a scheduler configured to receive fleet data, wells data, and solving parameters. The scheduler is configured to identify according to time constraints in the wells data: wells that have a beginning date of availability as ON wells, wells that have an end date but no beginning date of availability as BY wells, and wells that have no beginning or end date of availability as ADD wells. The scheduler is further configured to solve an integer problem for ON wells, a greedy method for BY wells, and a weight scoring method for ADD wells, and to output a schedule having a score, wherein the score pertains to how many of the time constraints are satisfied by the schedule. If the integer problem is not solved in a predetermined time period the scheduler is configured to implement the weight scoring method for all wells. The system also includes an optimizer configured to iteratively pass the fleet data, wells data, and solving parameters to the scheduler and to optimize based on the score.

DETAILED DESCRIPTION

The rig scheduling problem concerns finding a schedule for a fleet of rigs given a list of potential wells to be drilled. Each rig has a capacity and time period of availability, while each well comprises a production value, a pad assignment and a time window in which it can be drilled. Operational constraints limit the number of rigs on a pad to one, and the moving and dismantling time is applicable each time a rig moves from one pad to another. Notably, a narrow or restricted time window identifies wells with strong conditions imposed by client needs. That is, wells that must be drilled on or by certain days, often in order to retain lease rights. For this reason, the critical assumption in the procedure is firstly, to meet the satisfiable stipulated conditions, and secondly, to maximize the production value of the selected wells. Significantly, the fleet-sizing procedure can be used to identify how many additional rigs are required by type and period of use to meet the outstanding conditions, or to provide the optimal fleet size to meet the satisfiable conditions from the outset when no fleet is given. The proposed decomposition-based scheme is presented in this report with several practical test cases.

Wells

Consider a well w∈{1, . . . , W}. First w is assigned a “production value” denoted by V_(w). This value can be anything ranging from barrels of oil to net value generated by the well in $. This pre-computed fixed value should be defined with the purpose of being maximized.

In addition, w is part of a “pad” denoted by P_(w). A “pad” is a location from which one or multiple wells are drilled. When installed on a pad, a rig can drill multiple wells without being dismantled. Most importantly, on any given day, there can only be a single rig on a given pad (a rig is considered to be on a pad from the first day of its installation to the last day of its dismantling). Finally there are P pads numbered from 1 to P, and W_(p) denotes the set of wells on pad P∈{1, . . . , P}.

A well w can have timing requirements where T refers to a time period of interest. T_(w) ^(S) (resp. T_(w) ^(E)) is the first (resp. last) day when w is available to be drilled. If T_(w) ^(S)=1 and T_(w) ^(E)<T then w is referred to as a “BY” well. If T_(w) ^(S)=T_(w) ^(E) then w is referred to as a “ON” well. If w is neither ON or BY, then it is assumed that T_(w) ^(S)=1 and T_(w) ^(E)=T and is referred to as an “ADD” well. We denote W_(ON), W_(B), W_(ADD) the sets of ON, BY and ADD wells.

Finally, some wells can only be drilled by specific rigs so we denote the set of rigs that can drill w by R_(w)⊂{1, . . . , R}. Equivalently, w_(r) is the set of wells that rig r can potentially drill.

No Transportation Assumption

As previously mentioned, each well w belongs to a pad p. In this paper, it is assumed that the maximum time between two pads is relatively small compared to 24 hours (1 day) and hence can be neglected. The reason for this is that a “day” is the unit of measure of the rig capacity, installation and dismantling times. By incorporating transportation times of the order of hours, the resulting schedule will be very sensitive to external factors (delays due to traffic, weather for instance) and will not be robust.

More formally, it is possible, though not mandatory, to provide a position for each pad p denoted by(x_(p), y_(p)). If it is the case, one can easily compute the diameter of the field using D_(max)=max_(p,q){d(p,q)} where d(p,q) is the distance between two pads p and q (which can be d(p,q)=√{square root over ((x_(p)−x_(q))²+(y_(p)−y_(q))²)}). Furthermore, one can suppose a speed for the trucks transporting the rigs denoted by σ. The validity of the no transportation time assumption can be checked by the condition:

$\frac{D_{\max}}{\sigma}\text{,,}\mspace{14mu} T_{\max}$

where T_(max) denotes the maximum travel time.

The current model assumes no transportation time. Note that, if the transportation times are constant between any two pads and even multiple of days, then it can be incorporated as follows: add half of time in the installation and half in the dismantling time of each rig. If the transportation times are of the order of the day but differ between pads, then this model would have to be modified.

Data

In summary, the input data from the user is:

-   -   1. The time horizon considered which leads to the number of days         for the required schedule.     -   2. The rig information with each capacity, start and end days,         installing and dismantling times in days.     -   3. The well information with each value, pad, start and end         days.     -   4. The truck speed and maximum travel time to check the         no-transportation time assumption.

The notations are summarized in the following table:

TABLE 1 Parameters (in bold are the input parameters) Entity Feature Notation general number of days T number of wells W number of rigs R number of pads P set of ON wells W_(ON) set of BY Wells W_(BY) set of ADD Wells W_(ADD) truck speed σ maximum travel time T_(max) rig r capacity C_(r) start day T_(r) ¹ end day T_(r) ² installing time I_(r) dismantling time D_(r) moving time M_(r) set of drillable wells by r W_(r) well w value V_(w) pad P_(w) start day T_(w) ^(S) end day T_(w) ^(E) set of eligible rigs for w R_(w) pad p set of wells on p W_(p)

T_(r) ¹ (resp. T_(r) ²) is the first (resp. last) day when r is available to be used. Finally, I_(r) (resp. D_(r)) corresponds to the number of days required to install r on (resp. dismantle r from) a pad (see below for the definition of a pad) and M_(r)=I_(r)+D_(r) defines the moving time of r.

Objective Function

As the reason for time constraints imposed by the client are unclear to the operator, the first goal of the operator should be to maximize the number of time requirements that can be met given the aforementioned constraints. Given a schedule S, the number of constraints met is equal to the number of ON (N_(ON)(S)) and BY (N_(BY)(S)) wells that are drilled in S and is denoted by N(S)=N_(ON)(S)+N_(BY)(S). Secondly, a “good” schedule should aim to maximize the production value. The production value of a schedule S is the sum of the production values of all the selected wells in S and is denoted by V(S).

According to embodiments of the present disclosure, the objective function may be defined as:

$\max\limits_{S}\left( {{N(S)},{V(S)}} \right)$

and can be optimized lexicographically, i.e., firstly N(S) can be maximized and then V(S).

Note: this is equivalent to optimize the single objective function V×N(S)+V(S) where V is an upper bound on V(S) for all schedule S. However, for the ease of notation we will keep the vector notation.

Inconsistencies

If the rig fleet was large enough and conditions are satisfiable, the best schedule S should have N(S)=51 W_(ON)|+|W_(BBY)|. However this may not be possible due to inconsistencies in the input data. Preferably, these inconsistencies should be corrected by the user before solving the problem. There are two types of inconsistencies.

Pad Inconsistencies

Consider a pad p∈{1, . . . , P} such that |W_(p)

W_(ON)|>1. Consider each pair (w≠v)∈W_(p)

W_(ON) of distinct wells in pad p such that T_(w) ^(S), T_(v) ^(S). If

${T_{v}^{S} < {T_{w}^{S} + {\min\limits_{r \in R_{w}}\left\{ C_{r} \right\}}}},$

then either w or v cannot be drilled due to a pad inconsistency. In other words, if w has to be drilled before v, but their drilling time is not separated by at least the best rig capacity (the smallest one) that can drill w.

Rig Inconsistencies

Consider a rig r∈{1, . . . , R} and each pair (w≠v)∈W_(ON) of distinct wells such that R_(w)=R_(v)={r} and T_(w) ^(S), T_(v) ^(S). If

T _(v) ^(S) <T _(w) ^(S) +C _(r) +M _(r)×χ(P _(w) ≠P _(v))

where χ is the indicator function, then either w or v cannot be drilled due to a rig inconsistency.

Algorithms

In some embodiments the problem can be solved by formulating an integer program taking into account all types of wells (ON, BY and ADD) in conjunction with an appropriate solver (Cbc for open-source, Gurobi or CPlex if available). However, this solution appears to be intractable due to the curse of dimensionality, that is, the problem size becomes too large to solve for a high number of wells and rigs.

In order to bypass this issue, one can adopt one of two schemes detailed below:

1. An approximation scheme.

2. A decomposition scheme.

Approximation Algorithms

In this case, all wells are considered by a sub-optimal algorithm which gives the smallest optimality gap. Two such algorithms are considered:

-   -   A “weight scoring” algorithm with sub-functionals denoted by WS.     -   A “greedy” mechanism denoted by G.

Note that two other algorithms (called fastGreedy and Dual) that were studied are explained in the Appendix.

Weight Scoring (WS) Method

This method is a myopic method based on a scoring function computed with a set of weights. Note that in the following, t_(r, w) defines a function that depends on r and w, so we can use t_(s, v) to refer to the case s≠r and v≠w.

Scoring Function

Given a set of weights y such that y∈[01]⁴ with Σ_(i=1) ⁴y_(i)=1, the scoring function f_(y) is a function of w the potential well to drill, t_(r) the earliest available day of rig r, t_(r,w) . . . t_(r) the earliest day to drill well w with rig r. It is denoted by f_(y)(w,t_(r),t_(r,w)).

For w∈{1, . . . , W} and t_(r,w) ∈[1, . . . , T], we have:

f _(y)(w,t _(r) , t _(r,w))=y ₁ f ₁(w)+y ₂ f ₂(w,t _(r))+y ₃ f ₃(t _(r) , t _(r,w))+y ₄ f ₄(w)   (1)

and the sub-functionals (f_(i))i∈{1, . . . , 4} are described as follows:

f₁ is the normalized value of the well w. It gives a positive value to wells with high value:

$\begin{matrix} {{f_{1}(w)} = \frac{V_{w}}{\max\limits_{w^{\prime}}\left\{ V_{w^{\prime}} \right\}}} & (2) \end{matrix}$

f₂ is the normalized difference between the earliest available day of r and the end date of w. It emphasizes wells that have time constraints:

$\begin{matrix} {{f_{2}\left( {w,t_{r}} \right)} = \frac{T_{w}^{E} - t_{r}}{T}} & (3) \end{matrix}$

f₃ is the negative normalized idle time of rig r. It gives preference to wells that do not require the rig r to stand idle:

$\begin{matrix} {{f_{3}\left( {t_{r},t_{r,w}} \right)} = \frac{- \left( {t_{r,w} - t_{r}} \right)}{C_{r} + M_{r}}} & (4) \end{matrix}$

f₄ is the normalized function of rig requirements. It gives emphasis to wells that are highly constrained by rig requirements:

$\begin{matrix} {{f_{4}(w)} = {1 - \frac{R_{w}}{R}}} & (5) \end{matrix}$

Given a set of weights y, one approach according to embodiments of the present disclosure for WS works as follows:

Let t_(r)∈{1, . . . , T} be the earliest time for which at least one rig is available. Let r be such a rig with highest capacity.

1. Urgent Wells: A well w is urgent at time t_(r) for rig r if T_(w) ^(E)<t_(r)+C_(r)+M_(r) and urgentWells is the set of such wells. If urgentWells is not empty, consider the most urgent well w in this set. If w can be assigned to a different rig than r with less idle time than r or with same idle time but greater rig capacity, then do so and remove w from urgentWells. If not, assign w to the schedule of r and skip the next step. If all wells from urgentWells are assigned to other rigs than r, consider the next step.

2. Non-Urgent Wells : For all wells with a potential start date t_(r,w) such that t_(r,w)∈{t_(r), . . . , t_(r)+C_(r)+M_(r)−1}, compute the scoring function f_(y)(w,t_(r),t_(r,w)). Insert in the rigSchedule, the well w such that f_(y)(w,t_(r), t_(r,w)) is maximized.

FIG. 1 illustrates pseudo code for weight scoring method according to embodiments of the present disclosure. Pseudo code in this disclosure is to be understood to represent embodiments of how a method can be implemented. It is to be understood that there are alternative methods for coding and virtually limitless ways to code a given method and the present disclosure is not limited to the particulars of the pseudo code.

Weight Optimization

An astute reader will notice that the resulting schedule depends on the set of weights y used to compute the scoring function. However the optimal set of weights may not be known. Therefore the WS method considers a random search in the space of weights and retains the solution that maximizes the objective value. There is a convergence criteria on this search process: if there is no improvement of the best solution after a certain number of evaluations (κ∈N), then the search stops.

Note: a genetic algorithm approach was also implemented but the random weight procedure proved to be as effective with fewer evaluations.

Greedy (G) Method

According to embodiments of the present disclosure, the methods can include to rank the wells lexicographically first by end date, then by value, and then to check if the highest ranked well can be added to the schedule by finding the earliest start drilling day when the well is available ([T_(w) ^(S), T_(w) ^(E)]). The process can be repeated until the list of wells is empty. The pseudo code of the method is given below. [H]

FIG. 2 illustrates pseudo code for the Greedy method according to embodiments of the present disclosure.

Note that this method was designed to work fine for “BY” wells. However, it can also be used on a different set of wells with varying performance.

Decomposition

In other embodiments another solution to the approximation scheme is to consider wells separately by type. That is, consider constrained wells (ON and BY) and then ADD wells. Among constrained wells, since ON wells are more constrained, it seems appropriate that they should be treated first. Hence, consider three phases, comprising the set of ON then BY and finally, ADD wells. In this scheme, one can use WS and G approximation schemes described above, or alternatively an integer program, such as the one detailed below. In summary, we list the possible algorithms in preference order for each phase as follows:

1. Phase ON: integer program for ON wells (IPON), WS, G.

2. Phase BY: G, WS.

3. Phase ADD: WS, G.

Note that an integer program tested for ADD wells is presented in the Appendix. However it did not prove as effective as the WS or G schemes.

Integer Program for ON Wells (IPON)

The goal is to find a combination of ON wells in order to maximize the number of ON wells drilled. Note there can exist several such combinations, hence we differentiate the solutions by selecting the one with highest production value.

Let us define an “artificial” value V_(w) as: V _(w)=V _(w)+max_(w′∈W) _(ON) {V_(w′)}, and describe two incompatibility sets as follows:

1. Rig incompatibilities (I₁): this is the set of pairs of wells (w,v) that cannot be drilled by the same rig r, i.e. among the pairs in I₁ only one element can be drilled by r. Mathematically, this requirement is defined by:

I ₁={(w,v,r)∈W _(ON) ×W _(ON) \{w}××R_(w) |T _(v) ^(S) . . . T _(w) ^(S) , T _(w) ^(S) <T _(v) ^(S) +C _(r) ^(R) +M _(r)×χ(P _(v) ≠P _(w))}.

2. Pad incompatibilities (I₂): this is the set of pairs of wells (w,v) that cannot be drilled by the two distinct rigs r≠q. If two wells are on the same pad and their dates are “too” close, they cannot be drilled by two different rigs. That is, if two ON wells are on the same pad and their dates differ by less than the minimum rig capacity, it will be impossible to drill both wells. This is defined as follows:

I ₂={(w,v,r,q)∈W _(ON) ×W _(ON)

P _(w) \{w}×R _(w) ×R _(v) \{r}|T _(v) ^(S) . . . T _(w) ^(S) , T _(w) ^(S<T) _(v) ^(S) +C _(r) ^(R) +M _(r)}.

The only variable is

x_(wr)∈{0,1}:1 if well w is drilled by rig r∈R_(w)

We can formulate the IP as follows:

$\text{Maximize}\; \left( {\sum\limits_{w,r}{\overset{\_}{V_{w}}x_{wr}}} \right)$ subject to ${\sum\limits_{r}{x_{wr}\text{,,}\mspace{14mu} 1}},{\forall{w \in {ON}}}$ x_(wr) + x_(vr),,  1, ∀(w, v, r) ∈ I₁ x_(wr) + x_(vq),,  1, ∀(w, v, r, q) ∈ I₂

Solving this problem, we get the solution for the ON phase which gives an allocation of all possible ON wells to rigs that meet the given constraints (e.g. rig, pad, time windows, etc)

Scheduling Algorithm

Given all these algorithms, the proposed solution was chosen after testing the different methods on different test cases and is described below algorithmically.

Let T^(solve) be the time in seconds specified by the user to solve the scheduling problem.

FIG. 3 illustrates pseudo code for a scheduling algorithm according to embodiments of the present disclosure.

Rig Schedule

FIG. 4 is a schematic diagram 10 illustrating systems and methods for optimizing rig scheduling according to embodiments of the present disclosure. To schedule a rig fleet certain characteristics are identified and an order of priority is assigned to the characteristics. In some embodiments certain wells have constraints which may come from the lease of the land, access to the wellsite, geopolitical factors, or virtually any other constraint upon the timing of access to the well site. The wells are first grouped into three groups: “ON”, “BY”, and “ADD”. ON wells are wells which must be drilled on a given day or days. These are the highest priority because they are the least flexible. BY wells are wells with an end date of availability and as such must be drilled “by” a certain date. These are the second highest priority because there is more flexibility to the wells. If scheduling permits these wells can be drilled earlier than their “by” date, but not later. ADD wells (short for “additional”) includes all other wells that are not ON or BY wells. These wells are the third and lowest priority because they may be drilled anytime. In many cases there is a global end date to the drilling period in question, and this global end date is factored into calculations in addition to the other parameters.

The processes and methods illustrated in FIG. 4 can be executed by a scheduler 11. The scheduler takes as input: 1) a fleet data 12, which can include such parameters as R rigs, each with a capacity C_(r), start day T_(r) ¹, end day T_(r) ², installation I_(r) and dismantling D_(r) time. The scheduler also receives well data 14 which may include W wells to be drilled with a production value V^(w), a pad P_(w), a start day T_(w) ^(S), an end day T_(w) ^(E) and a set of permissible rigs R_(w). The scheduler 11 also receives a set of parameters 16 which may include the time horizon of T days and solver parameters such as the time specified by the user to solve the T_(solve), scheduling problem R^(solve) the convergence criteria for WS method and the integer program solver. With these inputs, the scheduler 11 first solves IPON 18 for ON wells 17. IPON 18 is an integer problem which is an attempt to solve the problem. It is possible for the constraints to be managable and the IPON 18 is solvable in which case the overall endeavor of scheduling the rig is simplified. If it is solved within a certain optimality gap |W_(ON)|×max_(w){V_(w)}), then BY wells 19 are treated by the G 20 method and ADD wells 22 with the WS 24 method. If IPON 18 was not solved, the scheduler 11 treats all wells using the WS 26 method. (The WS 26 method and WS 24 method can be the same method.) The scheduler 11 outputs a schedule S 28, the number of constraints met by S 28 denoted by N(S) and the total production value of the wells selected by S 28 denoted by V(S).

Accordingly, the scheduler 11 is configured to schedule wells in order of priority ON>BY>ADD, with other parameters such as production value having a lesser priority.

The following information was obtained using actual simulations and test data and is included to show certain features of the present disclosure and is not given in a limiting manner. Parameters and values are given here to show some test data but the scope of the present disclosure is not limited to the numerical values or relationships.

Data

The two data sets (representative of real test cases) are presented in Table 2.

TABLE 2 Data summary of two test cases Data Test Case A Test Case B start Date Jan. 1, 2016 Jan. 1, 2015 end Date Dec. 31, 2019 Dec. 31, 2019 R 5 5 W 571 1308 | W_(ON) | 41 48 | W_(BY) | 55 9

Note that the wells have different rigs requirements. Moreover, the rigs do not have the same start and end dates. We consider both test cases with identical rig installing/dismantling times of 0/0 and 3/2, giving a total of 4 test cases.

2.4.2 Results

Note that T^(solve)=60 s and the solver used was Cbc (expect for test case B with 3/2 where T^(solve)=300 s). Results are summarized in Table 3.

Test Case A1

:Test Case A with 0/0. Firstly, 2 inconsistencies are identified (1 of type pad and 1 of type rig). The resulting schedule drills 259 wells with 37 out of 41 ON wells and 55 out of 55 BY wells met, giving N(S)=92. In terms of value, V(S)=1.81×10⁶.

Test Case A2

:Test Case A with 3/2. Firstly, 2 inconsistencies are identified (1 of type pad and 1 of type rig). The resulting schedule drills 225 wells with 35 out of 41 ON wells and 55 out of 55 BY wells met, giving N(S)=90. In terms of value, V(S)=1.59×10⁶.

Test Case B1

:Test Case B with 0/0. Firstly, 6 inconsistencies are identified (6 of type rig). The resulting schedule drills 585 wells with 42 out of 48 ON wells and 9 out of 9 BY wells met, giving N(S)=51 . In terms of value, V(S)=4.13×10⁶.

Test Case B2

Test Case B with 3/2. Firstly, 7 inconsistencies are identified (7 of type rig). The resulting schedule drills 585 wells with 41 out of 48 ON wells and 9 out of 9 BY wells met, giving N(S)=50 3.69×10⁶.

TABLE 3 Results summary Test Test Test Test Data Case A1 Case A2 Case B1 Case B2 Rig Installing 0 3 0 3 Rig Dismantling 0 2 0 2 | W_(ON) | + | W_(BY) | 96 96 57 57 Inconsistencies 2 2 6 7 N_(ON) (S) 37 35 42 41 N_(BY) (S) 55 55 9 9 N (S) 92 90 51 50 V (S) × 10⁶ 1.81 1.59 4.13 3.69

Note that, in test case B, inconsistencies and N(S) sum up to |W_(ON)|+|W_(BY)| which indicates that the solution provided is the best given the data available (in terms of constraints).

In test case A, inconsistencies and N(S) do not sum to the total number of conditions. This state leads to the development of optimal fleet sizing in the next section.

Fleet Sizing

As shown in the previous section, some constraints may not be met due to the lack of rigs. Moreover, in the case where no rigs are owned, one may be interested in sizing a potential fleet to drill the given list of wells. This section aims to address these concerns.

Problem Description

New Data

As per to the original problem, there is a list of wells to drill and a fixed fleet of rigs which has a cost equal to 0. In addition, there are potential rigs to hire.

The first input is an upper bound on the number of additional rigs R^(Add) . . . 0. In addition, the list of hireable rigs is given by type of rigs. There are Δ types of rigs and each type of rig μ∈{1, . . . , Δ} is given with:

-   -   A capacity C_(μ) ^(A)∈N.     -   A number of rigs available N_(μ) ^(A)∈N: at most N_(μ) ^(A) rigs         of type μ can be added.     -   An installation time I_(μ) ^(A)∈N.     -   A dismantling time D_(μ) ^(A)∈N.     -   An earliest start date T_(μ) ^(A,1)∈N: a rig of type μ cannot be         hired earlier than T_(μ) ^(A,1)(1, T_(μ) ^(A,1), T).     -   An end date T_(μ) ^(A,2)∈N; a rig of type μ can be hired until         T_(μ) ^(A,2)(1, T_(μ) ^(A,2), T).     -   A minimum hiring period M_(μ) ^(A)∈N: minimum number of days for         which the rig has to be hired (M_(μ) ^(A), T_(μ) ^(A,2)−T_(μ)         ^(A,3)). So the latest start date is T_(μ) ^(A,2)−M_(μ) ^(A)+1.     -   A hiring cost C_(μ) ^(A,h): cost incurred just to hire a new rig         of type μ, specified in the same unit as the value of a well.     -   An operating cost C_(μ) ^(A,h): cost incurred per day of         utilization of a rig of type μ, also specified in the same unit         as the value of a well.

New Fleet

If R_(Add)=0, the problem is equivalent to the scheduling problem of the previous section and the scheduling algorithm solves the problem.

Given R_(Add)∈N, an additional fleet of R_(Add) rigs is defined as follows: for each additional rig r∈{1, . . ., R_(Add)}, the solution must specify:

-   -   The type of r, μ_(r)∈{0, . . . , Δ}, where μ_(r)=0 means that r         is not selected to be added as an additional rig.     -   The hiring start date d_(r) ¹ . . . T_(μ) _(r) ^(A,1).     -   The hiring end date D_(r) ², T_(μ) ^(A,2) such that d_(r)         ²−d_(r) ¹ . . . M_(μ) _(r) ^(A). The cost incurred is equal to         C_(μ) _(r) ^(A,h)+C_(μ) _(r) ^(A,o)(d_(r) ²−d_(r) ¹).

This solution can be represented by an array of size R_(Add)×3. Now, we simplify the representation of the new fleet for the solver. First, the type of the R_(Add) additional rigs can be expressed in a vector of integers of length R_(Add) (e.g. (1, 2, 0) represents a new fleet of one) rig of type 1 and one rig of type 2 for R_(Add)=3). Given R_(Add) and Δ and (N_(μ) ^(A))_(μ∈{1, . . . , Δ}), we can map each vector of types to a unique integer X (see a mapping example in Table 4).

TABLE 4 Mapping example for N_(Add) = 3, Δ = 3, (N₁ ^(A), N₂ ^(A), N₃ ^(A)) = (2, 1, 1). New Fleet New Fleet Type Integer Type Vector 1 (0, 0, 0) 2 (1, 0, 0) 3 (2, 0, 0) 4 (3, 0, 0) 5 (1, 1, 0) 6 (1, 2, 0) 7 (1, 3, 0) 8 (2, 3, 0) 9 (1, 1, 2) 10 (1, 1, 3) 11 (1, 2, 3)

In addition, (d¹, d²) can be mapped uniquely to another vector (α_(r) ¹, α_(r) ²(∈[0,1]² such that:

d _(r) ¹ =T _(μ) _(r) ^(A,1)+α_(r) ¹(T _(μ) _(r) ^(A,2) −M _(μ) _(r) ^(A) −T _(μ) _(r) ^(A,3)+1)

d _(r) ² =d _(r) ¹+α_(r) ²(T _(μ) ₄ ^(A,2) −d _(r) ¹)

Therefore a new fleet is defined by a vector F=(X,α¹, α²) of size 1+2R^(Add). The main advantage of this representation is that the genetic algorithm (GA) described below can be implemented without constraints, while taking into account all the new fleet constraints such as number of new rigs, start/end dates and minimum hiring time. It also reduces the number of variables

Finally, note that given a fleet F, we can pre-compute its cost C(F).

New Objective

The objective is slightly different from different from the previous section. The objective according to embodiments of the present disclosure is to find a new fleet F=(X,α¹, α²) and an associated schedule S(F) such that we maximize firstly the number of time constraints met denoted by N(S(F)), and then the net value defined by V(S(F))−C(F), mathematically that is:

$\max\limits_{F}\left( {\max\limits_{S{(F)}}\left( {{N\left( {S(F)} \right)},{{V\left( {S(F)} \right)} - {C(F)}}} \right)} \right)$

Genetic Algorithm

Given a fixed fleet and a new fleet F, the inner maximization can be solved using the scheduling algorithm described in the previous section. In order to deal with the outer maximization on F, we use a genetic algorithm scheme. In order to use this scheme, the user specifies:

1. R^(Add): number of additional rigs considered.

2. The population size.

3. The mutation probability.

4. A convergence criteria: if after a certain number of iterations, the best solution is not improved, the search stops.

5. The solving time permitted for the genetic algorithm.

6. The parameters of the scheduling algorithm, that is T^(solve), the MIP solver and the convergence criteria for WS.

We describe here the crossover and mutation operators.

Crossover

Given a population, we select the top half with the highest objective function values. The crossover operator selects randomly two distinct elements from this pool. In order to “crossover” F₁=(X,α¹, α²) and F₂=(Y,β¹, β²), the resulting fleet F₃=(Z,γ¹, γ²) is such that:

1. Draw λ uniformly at random in [¼,¾] and Z=nint(λX+(1−λ)Y).

2. For r∈{1, . . . ,R^(Add)},

(a) Draw λ uniformly at random in [¼,¾] and γ_(r) ¹=nint(λα_(r) ¹+(1−λ)β_(r) ¹).

(b) Draw λ uniformly at random in [¼,¾] and γ_(r) ²=nint*(λα_(r) ²+(1−λ)β_(r) ²).

where nint(.) is the nearest integer function.

Mutation

Given the mutation probability, for each element of the population, draw a Bernoulli random variable with this probability. If it is true, then draw randomly a new element.

Note that X=1 in the new fleet F is equivalent of not adding any additional fleet. Hence, the result of the scheduling algorithm is the same as before and independent of (α¹, α²). Therefore, the GA permits a new fleet with X=1 at most once in the initial population or after crossover and mutation.

FIG. 5 is a schematic diagram depicting an optimizing algorithm according to embodiments of the present disclosure. An optimization routine such as a genetic algorithm (GA), a meta heuristic such as Tabu Search or Simulated Annealing, or any other suitable optimization routine can be used. The optimization routine is performed by an optimizer 32. The optimization routine developed for the sizing problem takes as input fleet data 12, wells data 14, and other parameters 16. The optimizer 32 also receives new rig data 34 which holds the types of rigs available for hire with a capacity C_(μ) ^(A), the number of rigs available N_(μ) ^(A), the installation time I_(μ) ^(A), the dismantling time D_(μ) ^(A), the earliest start date T_(μ) ^(A,1), the end date T_(μ) ^(A,2) , a minimum hiring period M_(μ) ^(A), a hiring cost C_(μ) ^(A,h) and an operating cost C_(μ) ^(a,o). The parameter file includes the parameters of the scheduler 11 as well as parameters for the optimization routine including the population size, the mutation probability, a convergence criteria and the total solving time. With these inputs, we generate a population of fleets F 36. For each F_(i), the algorithm generates the fleet data 12′ as input to the scheduler 11. The output from the scheduler is used together with the cost C(F_(i)) 38 to establish the fitness value for each F_(i). The optimization routine's operations (crossover and mutation) are then applied to the population and this process repeats until the solving time or the convergence criteria is met. The optimizer 32 outputs the best fleet F* 28′ and its associated schedule S(F*) (and other metric such that N(S(F*)), V(S(F*)) and C(F*)).

Results

Recall that both cases Test B1 and Test B2 do not require any fleet sizing as the resulting schedule meets the maximum number of constraints (including the inconsistencies). Therefore, we focus here on Test A1 and Test A2.

We summarize the new rigs data as follows:

TABLE 5 Additional rigs Type 1 2 Number 1 1 Capacity 20 25 Installing Time 0 or 3 0 or 3 Dismantling Time 0 or 2 0 or 2 Start Jan. 1, 2016 Jan. 1, 2016 End Jan. 1, 2018 Jan. 1, 2018 Min Period 30 30 Hiring Cost 0 0 Operating Cost (per day) 500 400

We run the two cases A1 and A2 with R_(Add)=1,2 which results in four cases:

Test Case A1/1

:Test Case A1 with R^(Add)=1. The resulting fleet consists of one rig of type 1 from 29 Apr. 2016 to 24 Oct. 2016. The resulting schedule drills 269 wells with 39 out of 41 ON wells and 55 out of 55 BY wells met, giving N(S)=94. In terms of value, the production value is 1.86×10⁶, the cost incurred is 0.09×10⁶ which results in a net value of 1.77×10⁶.

Test Case A1/2

:Test Case A1 with R^(Add)=2. The resulting fleet consists of one rig of type 1 from 9 Apr. 2016 to 20 Nov. 2016. The resulting schedule drills 273 wells with 39 out of 41 ON wells and 55 out of 55 BY wells met, giving N(S)'94. In terms of value, the production value is 1.88×10⁶, the cost incurred is 0.11×10⁶ which results in a net value of 1.77×10⁶.

Test Case A2/1

:Test Case A2 with R^(Add)=1. The resulting fleet consists of one rig of type 1 from 1 May 2016 to 19 Oc. 2016. The resulting schedule drills 233 wells with 38 out of 41 ON wells and 55 out of 55 BY wells met, giving N(S)=93. In terms of value, the production value is 1.60×10⁶, the cost incurred is 0.09×10⁶ which results in a net value of 1.51×10⁶.

Test Case A2/2

Test Case A2 with R^(Add)=2. The resulting fleet consists of one rig of type 1 from 2 Apr. 2016 to 26 May 2017 and one rig of type 2 from 2 Apr. 2016 to 26 May 2017. The resulting schedule drills 250 wells with 39 out of 41 ON wells and 55 out of 55 BY wells met, giving N(S)=94. In terms of value, the production value is 1.73×10⁶, the cost incurred is 0.38×10⁶ which results in a net value of 1.35×10⁶.

TABLE 6 Results summary Test Test Test Test Data Case A1/1 Case A1/2 Case A2/1 Case A2/2 R_(Add) 1 2 1 2 Rig Installing 0 0 3 3 Rig Dismantling 0 0 2 2 | W_(ON) | + | W_(BY) | 96 96 96 96 Inconsistencies 2 2 2 2 N_(ON) (S(F)) 39 39 38 39 N_(BY) (S(F)) 55 55 55 55 N (S(F)) 94 94 93 94 V (S(F)) × 10⁶ 1.86 1.88 1.60 1.73 C (F) × 10⁶ 0.09 0.11 0.09 0.38 V (S(F)) − C (F) × 10⁶ 1.77 1.77 1.51 1.35

We find that in the case of 0/0 installing/dismantling times, one additional rig is sufficient to meet the total number of satisfiable constraints. That is, N(S(F)) and the inconsistencies sum to the total number of conditions. In the case of 3/2 installing/dismantling times, two rigs are required to meet all conditions, which reduces the net value significantly.

Three methods developed and tested, but not retained in the overall scheme, are presented in this section.

FIG. 6 is a schematic block diagram showing a method 40 according to embodiments of the present disclosure. At 42 parameters are collected. The parameters can be any salient parameter and includes fleet data and well data. The fleet data pertains to the fleet of rigs, the capacity, availability, cost of operating, moving, hiring the rigs, etc. Wells data includes time constraints for the wells. The parameters can also include the solution parameters such as convergence criteria and any other suitable parameter which may be needed. At 44 ON wells are identified. ON wells are wells which have a restrictive time window in which they must be drilled. In some cases, there are a few hours or a few days only in which the well can be drilled. The ON wells generally have a starting and ending availability window and as such are the most restrictive. At 46 BY wells are identified. BY wells are wells which must be drilled “by” a certain date/time. BY wells therefore have an ending availability time, but no beginning availability time. These wells are less restrictive than ON wells. At 48 ADD wells are identified. ADD wells can be simply the remainder of all wells, less ON and BY wells. Generally ADD wells have no time constraints upon when they can be drilled and as such are less restrictive than ON and BY wells. At 50 the method includes scheduling rigs with ON wells having higher priority than BY wells, and BY wells having higher priority than ADD wells. The method can also output a schedule for the rigs having a score, wherein the score pertains to how well or poorly the time constraints from which the ON, BY, and ADD designations are created.

FIG. 7 is a schematic block diagram of a method 60 according to further embodiments of the present disclosure. At 62 parameters are collected. This portion can be similar to 42 of the method 40 depicted in FIG. 6. The method 60 can also identify ON, BY, and ADD wells also in a similar manner. At 64 an integer problem for the ON wells is attempted. For some sets of data there is a simple solution and this attempt will produce a meaningful solution that does not require intensive computing. At 66 if the integer problem is not solved, the method includes applying the weight scoring method for all wells at 68. If, on the other hand, the integer problem is solved, at 70 the greedy method (or fast greedy method) is used for BY wells, and at 72 the weight scoring method is used for ADD wells. At 74 a schedule is output by the method which includes a schedule and a score that pertains to how well or poorly the schedule meets the ON, BY, and ADD criteria.

Method 1: Fast Greedy (FG) Method

This method is very similar to Greedy as it ranks wells based on their end dates (T_(w) ^(E)) and their values (V_(w)) lexicographically. The main difference occurs in the process of incorporating wells into the rig Schedule. Instead of considering wells one at a time, Fast Greedy steps through time and for every day a rig is available, it tries to slot a well in the schedule of this rig (where potential wells are considered in the aforementioned ranked order).

FIG. 8 illustrates pseudo code for a fast greedy method according to embodiments of the present disclosure.

Method 2: Dual (D) Method

This method has three steps. First we select wells for each rig using an integer program. Then these wells are inserted (ON then BY then ADD in a greedy manner) rig-by-rig. Finally it tries to insert additional wells in the idle times that were not selected in the first step.

1: Well Selection

In order to select a subset of potential “good” wells for each rig, D solves the following integer program. For clarity, we define V _(w)=V_(w)+|W_(ON)|×max_(w){V_(w)}We also define Δ to be the set of incompatible wells to be drilled by the same rig (see rig inconsistencies).

$\text{Maximize}\; \left( {\sum\limits_{w,r}{\overset{\_}{V_{w}}x_{wr}}} \right)$ subject to ${\sum\limits_{r}{x_{wr}\text{,,}\mspace{14mu} 1}},{\forall{w \in \left\{ {1,\ldots \mspace{11mu},W} \right\}}}$ ${\sum\limits_{r}{y_{pr}\text{,,}\mspace{14mu} 1}},{\forall{p \in \left\{ {1,\ldots \mspace{11mu},P} \right\}}}$ x_(wr) = 0, ∀r ∉ R_(w), ∀w ∈ {1, …  , W} ${{C_{r}{\sum\limits_{w}x_{wr}}} + {M_{r}{\sum\limits_{p}{y_{pr}\text{,,}\mspace{14mu} \left\lfloor \frac{T_{r}^{2} - T_{r}^{1} + 1}{\gcd \left( {C_{r},M_{r}} \right)} \right\rfloor {\gcd \left( {C_{r},M_{r}} \right)}}}}},{\forall{r \in \left\{ {1,\ldots \mspace{11mu},R} \right\}}}$ x_(wr),,  y_(P_(w)r), ∀w ∈ {1, …  , W}, ∀r ∈ {1, …  , R} x_(wr) + x_(vr),,  1, ∀r ∈ {1, …  , R}, ∀(w, v) ∈ Δ

We denote (X,Y), the optimal solution of this problem.

2: Preassigned Wells Insertion

For each rig r, we get from the previous step a list of wells pre-assigned to r, that is {w∈{1, . . . , W}|X_(wr)=1}. Given all these wells and rig r, we use the greedy method using V _(w) as indicative value of well w to slot wells in the schedule of r. We repeat this step for each rig r. Note that some of pre-assigned wells are not assigned to r and these are put in the pool of unassigned wells.

For each rig r:

-   -   A_(r)={w∈{1, . . . , W}|X_(w)=1} is a set of preassigned wells         to rig r.     -   Given this pre-assignment, allocate A_(r)         W_(ON) wells from this set using the greedy method.     -   Given this allocation of A_(r)         W_(ON) wells, allocate A_(r)         W_(BY) wells using the greedy method.     -   Finally allocate A_(r)         W_(ADD) wells using the greedy method.

3: Unassigned Wells Insertion

Given the schedule obtained in Step 2, we have a set of unassigned wells U. We use a modified greedy algorithm to try to slot the wells from the set U. First, we rank the wells in U by value. For each well w∈U, we check if it can be inserted in the schedule of rig r by sliding the pre-assigned wells if possible. If w cannot be assigned it is removed from U. This operation is repeated until U is empty.

Method 3: Integer Program for ADD Wells (IPADD)

We define P_(ADD) as the set of pads with at least one ADD well. Given the resulting schedule from the BY phase, we can identify “slots” in which wells can be drilled. A slot s corresponding to rig r has 4 attributes:

1. T_(rs) ^(C): a start date, i.e. the day after the rig stopped drilling the previous well.

2. T_(rs) ^(F): an end date, i.e. the day before the rig starts drilling another well

3. P_(rs) ^(C): the pad on which the previous well was drilled (0 if T_(rs) ^(C)==1)

4. P_(rs) ^(F): the pad on which the next well is drilled (0 if T_(rs) ^(F)==H)

Given a rig r, a slot is eligible depending on the following rules:

-   -   T_(rs) ^(F)−T_(rs) ^(C) . . . C_(r) and P_(rs) ^(C)=P_(rs)         ^(F)≠0     -   If T_(rs) ^(F)−T_(rs) ^(C) . . . C_(r)+M_(r) and one of the         three conditions: P_(rs) ^(C)=0 or P_(rs) ^(F)=0) or P_(rs)         ^(R)≠P_(rs) ^(F)

Given a rig r, let S_(r) be the set of eligible slots for this rig with its 4 features.

We define I₃, to be the incompatible set of slots. Given two distinct rigs r≠q and two slots s∈S_(r),t∈S₄ such that they “overlap”, we only allow a pad to be drilled within one of these time slots but not both in order to avoid pad conflicts. Mathematically, we state:

I ₃={(r,q,s,t)∈{1, . . . , R}×{1,. . . ,R}\{r}×S _(r) ×S _(q) |[T _(r) ^(C) , T _(rs) ^(F) ]

[T _(qt) ^(C) ,T _(qt) ^(F)]≠Ø}

The two types of variables are

x_(wrs)∈{0,1}:1 if well w∈W_(ADD) is drilled by rig r∈R_(w) in slots ∈S_(r)

y_(prs)Å{0,1}:1 if p ad p∈P_(ADD) is drilled by rig r∈R in slots ∈S_(r)

We formulate the IP as follows:

$\text{Maximize}\; \left( {\sum\limits_{w,r,s}{V_{w}x_{wrs}}} \right)$ subject to: ${\sum\limits_{r}{x_{wr}\text{,,}\mspace{14mu} 1}},{\forall{w \in W_{ADD}}}$ x_(wrs),,  y_(P_(w)rs), w ∈ W_(ADD), r ∈ R_(w), s ∈ S_(r) y_(prs) + y_(pqt),,  1, p ∈ P_(ADD), (r, q, s, t) ∈ I₃ ${{C_{r}{\sum\limits_{w}x_{wrs}}} + {M_{r}{\sum\limits_{p}y_{prs}}} - {I_{r}y_{P_{rs}^{C_{rs}}}} - {D_{r}y_{P_{rs}^{F_{rs}}}\text{,,}\mspace{11mu} T_{rs}^{F}} - T_{rs}^{C} + 1},{r \in \left\{ {1,\ldots \mspace{11mu},R} \right\}},{s \in S_{r}}$

where y_(P) _(w) _(rs)=y_(prs) with p=P_(w), y_(P) _(rs) C_(rs)=y_(prs) with p=P_(rs) ^(C) and y_(P) _(rs) F_(rs)=y_(prs) with p=P_(rs) ^(F). Recall that I_(r) and D_(r) are the rig installing and dismantling times of r.

This problem provides the allocation of wells to slots. Note that if a well from pad _(rs) ^(C) or P_(rs) ^(F) is selected for slot s of rig r, then it should be placed continuously with the pad (i.e.

at the beginning or the end of the slot). Subsequently, the order of the other pads within a given slot does not affect the quality of the solution in this setting, as well as the order of wells within a pad.

The systems and methods of the present disclosure are directed to new approaches to the rig scheduling problem based on a number of decomposition and approximation schemes. Many algorithms were described and combined into a composite procedure with the aim of addressing the satisfiable conditions while maximizing the production value of the selected wells. In some applications there are conditions that cannot be met which is due to inconsistencies in the data or due to the lack of rig capacity. For the latter, the method also provides the means to establish the optimal fleet size required to satisfy the outstanding requirements and increase the overall production value. Future considerations include improving the mutation operator of the genetic algorithm for sizing and considering the possibility of using generic time windows for all wells. 

1. A method, comprising: receiving a list of wells to be drilled; dividing the wells into ON wells which have a specific start date of drilling availability, BY wells which have a fixed end date of drilling availability but no start date of drilling availability; and ADD wells which have no start or end data of drilling availability; receiving fleet data, wells data, and parameters, wherein the parameters include a time horizon for the drilling operation; attempting to solve an integer problem according to the ON wells; if the integer problem is solved, implementing a greedy method for BY wells and a weight scoring method for ADD wells; and if the integer problem is not solved, implementing the weight scoring method for all wells; and outputting a schedule for rigs and the wells.
 2. The system of claim 1 wherein the greedy method comprises: sorting wells according to the earliest day on which the wells are available to be drilled and then by a value of the wells; for each rig available to drill, identifying an earliest start date and assigning a rig to the start date for the well.
 3. The system of claim 1 wherein the weight scoring method comprises: identifying urgent wells, wherein an urgent well is a well in which the earliest time to start drilling the well is earlier than the earliest time a rig is available for drilling, when factoring in the cost of using the rig and a moving cost for the rig; identifying non-urgent wells, wherein a non-urgent well has a potential start date such that there is an available start date for at least one rig that is earlier than the earliest available date for the well; randomly choosing weights; repeatedly calculating a solution using weights generated by the weights; retaining a solution that maximizes an objective value of the solution; if there is no improvement of the objective value of the solution after a predetermined number of attempts, ceasing calculating the solution and delivering the retained solution, wherein urgent wells are given higher priority than non-urgent wells.
 4. The method of claim 1 wherein the parameters further include a time for solving the integer problem.
 5. The method of claim 1 wherein the parameters further include a convergence criteria for the integer problem.
 6. The method of claim 1 wherein the parameters further include a convergence criteria for the weight scoring method.
 7. The method of claim 1 wherein the parameters further include a convergence criteria for the greedy method.
 8. The method of claim 1 wherein the parameters further include at least one of capacity, number of rigs available, installation time, dismantling time, earliest start date, end date, minimum hiring period, hiring cost, and operating cost.
 9. The method of claim 1, further comprising deploying the rigs according to the schedule.
 10. A method for optimizing fleet scheduling, comprising: identifying ON wells which have a beginning time of drilling availability, BY wells which have an end time but no beginning time of drilling availability, and ADD wells which have no beginning or end time of drilling availability, according to ON, BY, and ADD constraints; scheduling rigs to drill the wells with ON wells having higher priority than BY wells, and with BY wells having higher priority than ADD wells; returning a schedule for rigs and wells, the schedule having a value corresponding to a number of ON, BY, and ADD constraints which are satisfied by the schedule.
 11. The method of claim 10, further comprising factoring in value of the wells at a lower priority than the ON, BY, or ADD constraints.
 12. The method of claim 10, further comprising implementing a genetic algorithm to optimize the value of the schedule.
 13. The method of claim 10, further comprising factoring in installation time, dismantling time, hiring cost, operating cost, and transport time to the value, each at a lower priority than ON, BY, or ADD constraints.
 14. The method of claim 10, further comprising calculating a cost according to the schedule, and factoring in the cost to the value of the schedule.
 15. The method of claim 10, further comprising deploying the rigs according to the schedule.
 16. A system for optimizing a rig schedule for drilling a plurality of wells, comprising: a scheduler configured to receive fleet data, wells data, and solving parameters, the scheduler being configured to identify according to time constraints in the wells data: wells that have a beginning date of drilling availability as ON wells; wells that have an end date but no beginning date of drilling availability as BY wells; and wells that have no beginning or end date of drilling availability as ADD wells; the scheduler being further configured to solve an integer problem for ON wells, a greedy method for BY wells, and a weight scoring method for ADD wells, and to output a schedule having a score, wherein the score pertains to how many of the time constraints are satisfied by the schedule, wherein if the integer problem is not solved in a predetermined time period the scheduler is configured to implement the weight scoring method for all wells; an optimizer configured to iteratively pass the fleet data, wells data, and solving parameters to the scheduler and to optimize based on the score.
 17. The system of claim 16 wherein the greedy method comprises sorting wells according to the earliest day on which the wells are available for drilling and then by a value of the wells; and for each rig available to drill, identifying an earliest start date and assigning a rig to the start date for the well.
 18. The system of claim 16 wherein the weight scoring method comprises: randomly choosing weights; repeatedly calculating a solution using weights generated by the weights; retaining a solution that maximizes an objective value of the solution; if there is no improvement of the objective value of the solution after a predetermined number of attempts, ceasing calculating the solution and delivering the retained solution.
 19. The system of claim 18 wherein the weight scoring method further comprises: identifying urgent wells, wherein an urgent well is a well in which the earliest time to start drilling the well is earlier than the earliest time a rig is available, when factoring in a cost of using the rig and a moving cost for the rig; identifying non-urgent wells, wherein a non-urgent well has a potential start date such that there is an available start date for at least one rig that is earlier than the earliest available date for the well; and giving higher priority to urgent wells than non-urgent wells.
 20. The system of claim 18 wherein the weights pertain to a drilling availability of wells. 